Modelagem Vetorial Estendida por Regras de Associação
نویسندگان
چکیده
The goal of this work is to present an extension to the vector model that accounts for the correlation among query terms, by using association rules, a popular data mining technique. In Information Retrieval, the vector model allows retrieving a set of documents from a termbased query, where both query terms and documents are vectors in a vector space. Although the vector model has been used succesfully for decades, there are no practical and efficient mechanisms that account for correlations among query terms in each document from the collection until now. The novelty of this work is the proposal of a method for computing the correlations among query terms. The changes to the original vector model are minimal, and experimental results show that our extended vector model enhances the precision of the results for all the collections evaluated.
منابع مشابه
Suporte de Ontologias Aplicadas à Mineração de Dados por Regras de Associação
Data Mining (DM) for association rules tends to generate an unmanageable number of rules affecting the scope of its application. To solve this problem we propose the use of ontologies in the stages of pre and post-processing tasks to support the MD. In addition, the article points out that human organizations require the notions of possibility, subjectivity and interpretation, contrasting with ...
متن کاملExpansão da Expressividade Semântica na Representação de Regras de Negócio em Cenários de Processos Intensivos em Conhecimento(Expanding the Semantic Expressivity of Business Rules Representations in Knowledge-Intensive Processes)
In Knowledge-intensive scenarios, modeling languages should allow several aspects to be modeled with the purpose of both human visualization and computational processing. The declarative modeling paradigm has been broadly adopted in such scenarios due to its advantages in representing flexible and unstructured process, so called knowledge-intensive processes (KIP). However, the languages and on...
متن کاملText Simplification as Tree Transduction
Lexical and syntactic simplification aim to make texts more accessible to certain audiences. Syntactic simplification uses either hand-crafted linguistic rules for deep syntactic transformations, or machine learning techniques to model simpler transformations. Lexical simplification performs a lookup for synonyms followed by context and/or frequency-based models. In this paper we investigate mo...
متن کاملSeparação e Validação de Regras de Negócio MDA através de Ontologias e Orientação à Aspectos
Two important challenges for MDA designers are to make business rules independent of the platform specific model and to ensure that the resulting implementation does not violate the properties within these business rules. In this paper we present an approach that allows developers to both describe and verify domain properties at run time. In our approach, an ontology specifies domain properties...
متن کاملA Niched Genetic Algorithm for Classification Rules Discovery in Real Databases
⎯ This paper presents a Niched Genetic Algorithm (NGAE) that uses Elitism and other techniques that makes it efficient for classification rule mining problems using real databases. This implementation was compared to other classical tools of classification. The results obtained with NGAE were similar to those obtained with the classical tools. A great advantage of the proposed Niched Genetic A...
متن کامل